% Literature for the AREP manual (arep.tex)
% -----------------------------------------

@string{ AcaPress   = "Academic Press"                                       }
@string{ ACM        = "ACM Press"                                            }
@string{ AddWes     = "Addison-Wesley"                                       }
@string{ AMS        = "American Mathematical Society"                        }
@string{ Birkhaeus  = "Birkh{\accent127 a}user, Basel"                       }
@string{ BIWissV    = "BI-Wis\-sen\-schafts\-ver\-lag, Mannheim"             }
@string{ CamUPress  = "Cambridge University Press"                           }
@string{ Clarendon  = "Clarendon, Oxford"                                    }
@string{ Dover      = "Dover Publications, New York"                         }
@string{ Gruyter    = "Walter de Gruyter, Berlin, New York"                  }
@string{ HDeutsch   = "Verlag Harri Deutsch, Frankfurt/Main"                 }
@string{ Macmillan  = "The Macmillan Company, New York"                      }
@string{ OxUnPress  = "Oxford University Press"                              }
@string{ Pergamon   = "Pergamon Press, Oxford"                               }
@string{ SpringerB  = "Springer, Berlin"                                     }
@string{ SpringerBH = "Springer, Berlin and Heidelberg"                      }
@string{ SpringerBN = "Spinger, Berlin and New York"                         }
@string{ Wiley      = "John Wiley, New York"                                 }
@string{ Reidel     = "Reidel, Dordrecht, Boston"                            }
 


@BOOK{CB93,
  AUTHOR = 	 {Clausen, M. and Baum, U.},
  TITLE = 	 {Fast Fourier Transforms},
  PUBLISHER = 	 BIWissV,
  YEAR = 	 1993
}

@ARTICLE{CT65,
  AUTHOR  = {Cooley, James W. and Tukey, John W.},
  TITLE   = {An Algorithm for the Machine Computation 
             of Complex Fourier Series},
  JOURNAL = {Mathematics of Computation},
  VOLUME  = 19,
  YEAR    = 1965,
  PAGES   = {297--301},
  COMMENT = {
    Der Klassiker zur Cooley-Tukey-FFT
  }
}

@PHDTHESIS{Egn97,
  AUTHOR  = {Egner, S.},
  TITLE   = {{Zur Algorithmischen Zerlegungstheorie 
              linearer Transformationen mit Symmetrie}},
  YEAR    = 1997,
  SCHOOL  = {Universit{\accent127 a}t Karlsruhe}
}

@BOOK{ER82,
  AUTHOR    = {
    Elliott, Douglas F. and
    Rao, K. Ramamohan
  },
  TITLE     = {Fast Transforms --- Algorithms, Analyses, Applications},
  PUBLISHER = AcaPress,
  YEAR      = 1982
}

@ARTICLE{Leo91,
  AUTHOR  = {Leon, S. Jeffrey},
  TITLE   = {{
    Permutation Group Algorithms Based on Partitions, I:
    Theory and Algorithms
  }},
  JOURNAL = {Journal of Symbolic Computation},
  YEAR    = 1991,
  VOLUME  = 12,
  PAGES   = {533--583}
}

@BOOK{Mal92,
  AUTHOR    = {Malvar, Henrique S.},
  TITLE     = {Signal Processing with Lapped Transforms},
  PUBLISHER = {Artech House},
  YEAR      = 1992
}

@BOOK{Mer96,
  AUTHOR = 	 {Mertins, A.},
  TITLE = 	 {Signaltheorie},
  PUBLISHER = 	 {Teubner Verlag},
  YEAR = 	 1996
}

@PHDTHESIS{Min93,
  AUTHOR =   {Minkwitz, T.},
  TITLE =    {{Algorithmensynthese f{\accent127 u}r 
     lineare Systeme mit Symmetrie}},
  SCHOOL =   {Universit{\accent127 a}t Karlsruhe},
  YEAR =     1993
} 

@ARTICLE{Min95,
  AUTHOR = {Minkwitz, T.},
  TITLE = {{Algorithms Explained by Symmetry}},
  JOURNAL = {Lecture Notes on Computer Science},
  VOLUME = 900,
  YEAR = {1995},
  PAGES = {157--167}
}

@ARTICLE{Min96,
  AUTHOR = {Minkwitz, T.},
  TITLE = {{Extension of Irreducible Representations}},
  JOURNAL = {Applicable Algebra in Engineering, 
    Communication and Computing},
  YEAR = {1996},
  VOLUME = {7},
  PAGES = {391--399}
}

@PHDTHESIS{Pue98,
  AUTHOR = {P{\accent127 u}schel, M.},
  TITLE  = {{K}onstruktive {D}arstellungstheorie
            und {A}lgorithmengenerierung},
  YEAR   = {1998},
  SCHOOL = {Universit{\accent127 a}t Karlsruhe, Informatik},
  NOTE   = {Translated in \cite{Pue99}}
}

@TECHREPORT{Pue99,
  AUTHOR = {P{\accent127 u}schel, M.},
  TITLE  = {Constructive Representation Theory and Fast Signal Transforms},
  INSTITUTION = {Drexel University, Philadelphia},
  NUMBER = {Drexel-MCS-1999-1},
  YEAR = {1999},
  NOTE = {Translation of \cite{Pue98}}
}

@ARTICLE{Rad68,
  AUTHOR  = {Rader, Charles M.},
  TITLE   = {Discrete Fourier Transforms When the 
             Number of Data Samples is Prime},
  JOURNAL = {Proceedings of the IEEE},
  VOLUME  = 56,
  YEAR    = 1968,
  PAGES   = {1107--1108},
  COMMENT = {
    Die Rader FFT auf Primzahll{\"a}nge. Kurz und knackig.
  }
}
